Steiner's problem in graphs: heuristic methods
نویسندگان
چکیده
منابع مشابه
Steiner's Problem in Graphs: Heuristic Methods
VoD, S., Steiner’s problem in graphs: heuristic methods, Discrete Applied Mathematics 40 (1992) 45-72. Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner’s problem in graphs is included within this context. According to its complexity one is interes...
متن کاملHeuristic Methods for Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...
متن کاملA heuristic for the Steiner problem in graphs
In this paper, we present a heuristic for the Steiner problem in graphs (SPG) along with some experimental results. The heuristic is based on an approach similar to Prim’s algorithm for the minimum spanning tree. However, in this approach, arcs are associated with preference weights which are used to break ties among alternative choices of shortest paths occurring during the course of the algor...
متن کاملHeuristic Methods for the Unrestricted Dynamic Container Relocation Problem
In this work, we address the unrestricted Dynamic Container Relocation Problem (DCRP). The DCRP is an extension of the Container Relocation Problem (CRP) that is NPhard. The CRP aims to empty a single yard-bay, which contains containers with a given retrieval sequence from the yardbay, such that the total number of relocations is minimized. The DCRP extends the CRP so that containers both arriv...
متن کاملHeuristic methods for vehicle routing problem with time windows
This paper documents our investigation into various heuristic methods to solve the vehicle routing problem with time windows (VRPTW) to near optimal solutions. The objective of the VRPTW is to serve a number of customers within prede®ned time windows at minimum cost (in terms of distance travelled), without violating the capacity and total trip time constraints for each vehicle. Combinatorial o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90021-2